Imprimitive cometric association schemes: Constructions and analysis
نویسندگان
چکیده
Dualizing the “extended bipartite double” construction for distance-regular graphs, we construct a new family of cometric (or Q-polynomial) association schemes with four associate classes based on linked systems of symmetric designs. The analysis of these new schemes naturally leads to structural questions concerning imprimitive cometric association schemes, some of which we answer with others being left as open problems. In particular, we prove that any Q-antipodal association scheme is dismantlable: the configuration induced on any subset of the equivalence classes in the Q-antipodal imprimitivity system is again a cometric association scheme. Further examples are explored.
منابع مشابه
Some new constructions of imprimitive cometric association schemes
In a recent paper [9], the authors introduced the extended Q-bipartite double of an almost dual bipartite cometric association scheme. Since the association schemes arising from linked systems of symmetric designs are almost dual bipartite, this gives rise to a new infinite family of 4-class cometric schemes which are both Q-bipartite and Q-antipodal. These schemes, the schemes arising from lin...
متن کاملUniformity in association schemes and coherent configurations: Cometric Q-antipodal schemes and linked systems
Inspired by some intriguing examples, we study uniform association schemes and uniform coherent configurations. Perhaps the most important subclass of these objects is the class of cometric Q-antipodal association schemes. The concept of a cometric association scheme (the dual version of a distance-regular graph) is well-known; however, until recently it has not been studied well outside the ar...
متن کاملAlgorithmic Approach to Non-symmetric 3-class Association Schemes
There are 24 feasible parameter sets for a primitive non-symmetric association schemes with 3 classes and at most 100 vertices. Using computer search, we prove non-existence for three feasible parameter sets. Eleven cases are still open. In the imprimitive case, we survey the known results including some constructions of infinite families of schemes. In the smallest case that has been open up t...
متن کاملNon-symmetric 3-class association schemes
There are 24 feasible parameter sets for a primitive non-symmetric association schemes with 3 classes and at most 100 vertices. Using computer search, we prove non-existence for three feasible parameter sets. Eleven cases are still open. In the imprimitive case, we survey the known results including some constructions of infinite families of schemes. In the smallest case that has been open up t...
متن کاملImprimitive Q-polynomial Association Schemes
It is well known that imprimitive P -polynomial association schemes X = (X, {Ri}0≤i≤d) with k1 > 2 are either bipartite or antipodal, i.e., intersection numbers satisfy either ai = 0 for all i, or bi = cd−i for all i 6= [d/2]. In this paper, we show that imprimitiveQ-polynomial association schemesX = (X, {Ri}0≤i≤d) with d > 6 and k∗ 1 > 2 are either dual bipartite or dual antipodal, i.e., dual ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006